Noising methods for a clique partitioning problem
نویسندگان
چکیده
منابع مشابه
A Branch and Bound Method for a Clique Partitioning Problem
[1] J.-P. Barthélemy, B. Leclerc, “The median procedure for partitions”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 19, 1995, 3-34. [2] I. Charon, O. Hudry, “The noising method: a new combinatorial optimization method”, Operations Research Letters 14, 1993, 133-137. [3] P. Hansen, B. Jaumard, “Cluster analysis and mathematical programming”, Mathematical Programming 7...
متن کاملA Parallel Neural Networks Algorithm for the Clique Partitioning Problem
This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. Given a graph G = (V, E) , a clique is a complete subgraph in G. The clique partitioning problem is to partition the vertices in G into a number of cliques such that each vertex appears in one and only one clique. The clique partitioning problem has important applications in many areas inc...
متن کاملPolyhedral methods for the maximum clique problem
This paper presents an integer programming approach to the maximum clique problem. An initial linear programming relaxation is solved and, when there is an integrality gap, this relaxation is strengthened using one of several tightening procedures. This is done through the addition of cutting planes to the linear program. The bulk of the paper deals with theoretical and computational issues ass...
متن کاملAn Iterated Tabu Search Approach for the Clique Partitioning Problem
Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoint subsets such that the sum of the edge weights over all cliques induced by the subsets is as small as possible. We develop an iterated tabu searc...
متن کاملLagrangian relaxation and pegging test for the clique partitioning problem
The clique partitioning problem is an NP-hard combinatorial optimization problem with applications to data analysis such as clustering. Though a binary integer linear programming formulation has been known for years, one needs to deal with a huge number of variables and constraints when solving a large instance. In this paper, we propose a size reduction algorithm which is based on the Lagrangi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.05.029